A Linear Time Algorithm for Tree Mapping
نویسنده
چکیده
Inconsistencies between a phylogenetic tree calculated from a set of related genes and known species phylogeny may be due to duplications events in the gene family under study. Tree Mapping attempts to pinpoint gene duplications in order to explain such discrepancies. The e ort in this explanation is measured using a tree mapping measure. Very little algorithmic work has so far been invested into the computation of these measures and an algorithm in practical use today (Page, Syst. Biol. 43:58{77,1994) runs in time quadratic in the number genes. In this paper we present a linear time algorithm for a tree mapping measure. This improvement makes the processing of large gene and species trees possible as they may arise in the study of large gene families.
منابع مشابه
Application of Different Methods of Decision Tree Algorithm for Mapping Rangeland Using Satellite Imagery (Case Study: Doviraj Catchment in Ilam Province)
Using satellite imagery for the study of Earth's resources is attended by manyresearchers. In fact, the various phenomena have different spectral response inelectromagnetic radiation. One major application of satellite data is the classification ofland cover. In recent years, a number of classification algorithms have been developed forclassification of remote sensing data. One of the most nota...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملA novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals
Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...
متن کاملMapping of Pruned Tree-Structured Scalar Quantizers to Companding: A Design Strategy
Pruned tree-structured scalar quantizers are a form of non-uniform scalar quantizer that are named due to being designed via pruning a tree-structured scalar quantizer [1]. If designed via pruning a uniform tree-structured scalar quantizer, such a quantizer may be mapped to a piecewise linear compandor. An algorithm has been developed for mapping a piecewise linear compandor onto a a tree-struc...
متن کاملForest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data
Forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. Traditional methods such as field surveys are almost time-consuming and cost-intensive. Improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. This research co...
متن کامل